adjacent edges

krawędzie przyległe

English-Polish dictionary of Electronics and Computer Science. 2013.

Look at other dictionaries:

  • Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… …   Wikipedia

  • König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into …   Wikipedia

  • Quadrilateral — This article is about four sided mathematical shapes. For other uses, see Quadrilateral (disambiguation). Quadrilateral Six different types of quadrilaterals Edges and vertices 4 …   Wikipedia

  • Dual polygon — In geometry, polygons are associated into pairs called duals, where the vertices of one correspond to the edges of the other. Contents 1 Properties 2 Kinds of duality 2.1 Rectification …   Wikipedia

  • Total coloring — [ Proper total coloring of Foster Cage with 6 colors. The total chromatic number of this graph is 6 sincethe degree of each vertex is 5 (5 adjacent edges + 1 vertex=6).] In graph theory, total coloring is a type of coloring on the vertices and… …   Wikipedia

  • Yoshizawa-Randlett system — The origami crane diagram, using the Yoshizawa Randlett system The Yoshizawa Randlett system is a diagramming system used to describe the folds of origami models. Many origami books begin with a description of basic origami techniques which are… …   Wikipedia

  • Reversi — Not to be confused with Reversis. Reversi/Othello Players 2 Age range Recommended for 5 years or older Setup time 5–10 seconds …   Wikipedia

  • Origami techniques — This page shows basic information about the most commonly used techniques in the Japanese art of origami. Origami symbols*Turn over. *Rotate. *Unfold. *Valley Fold. *Mountain fold. *Inflate. *Reverse Fold. *Sink Fold. *Repeat Behind.Basic… …   Wikipedia

  • Canadian traveller problem — In computer science and graph theory, the Canadian traveller problem is a generalization of the shortest path problem to graphs where the cost of traversing an edge isn t completely known until reaching it. The problem was introduced by… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.